CEO's Apology in Twitter: A Case Study of the Fake Beef Labeling Incident by E-Mart
نویسندگان
چکیده
We present a preliminary study on how followers and non-followers of a popular CEO respond differently to a public apology by the CEO in Twitter. Sentiment analysis tool was used to measure the effect of the apology. We find that CEO’s apology had clear benefits in this case. As expected, it was more effective to followers than non-followers. However, followers showed a higher degree of change in both positive and negative sentiments. We also find that negative sentiments have stronger dynamics than positive sentiments, in terms of the degree of change. We provide insights on the potential for efficient crisis communication in online social media and we discuss future research agenda.
منابع مشابه
Insider Privacy Breach and Trust Restoration: Is the CEO's Gender as Important as the CEO's Response?
In this study we use Politeness Theory to understand the trust violation and restoration process. The study examines the role of CEO gender, perceived CEO status, and response type (apology vs. denial) on restored trust and trusting beliefs in the case of an insider data breach incident. The data were collected using a scenario based experiment from students studying in a Midwestern University....
متن کاملEdge pair sum labeling of spider graph
An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} accordin...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملRole of Monolingualism/Bilingualism on Pragmatic Awareness and Production of Apology Speech Act of English as a Second and Third Language
The present study investigated the pragmatic awareness and production of Iranian Turkish and Persian EFL learners in the speech act of apology. Sixty-eight learners of English studying at several universities in Iran were selected based on simple random sampling as the monolingual and bilingual participants. Data were elicited by means of a written discourse self-assessment/completion test (WDS...
متن کامل